package com.example.leetdemo.process;

import java.util.HashMap;
import java.util.Map;

public class Solution2311 {

    public int longestSubsequence(String s, int k) {
        Map<Integer, Integer> map = new HashMap<>();
        int dp[][] = new int[s.length()][];
        int p = 0, q = s.length() - 1;

        for (int i = 0; i < s.length(); i++) {
        }
        return 0;
    }

    public static void main(String[] args) {
        String s = "1010001";
        int t = Integer.parseInt("1010001", 2);
        System.err.println(t);
        for (int i = 0; i < s.length(); i++) {
            System.err.println(Integer.parseInt(s.substring(0, i + 1), 2) + "  "
                    + Integer.parseInt(s.substring(i, s.length()), 2));
        }

    }

}
